On Connection between the Convolutive and Ordinary Nonnegative Matrix Factorizations
نویسندگان
چکیده
A connection between the convolutive nonnegative matrix factorization (NMF) and the conventional NMF has been established. As a results, we can convey arbitrary alternating update rules for NMF to update rules for CNMF. In order to illustrate the novel derivation method, a new ALS algorithm for CNMF is proposed based on solving nonnegative quadratic programming problems. The experiment will confirm validity and high performance of our method, and of the proposed algorithm.
منابع مشابه
A Modified Digital Image Watermarking Scheme Based on Nonnegative Matrix Factorization
This paper presents a modified digital image watermarking method based on nonnegative matrix factorization. Firstly, host image is factorized to the product of three nonnegative matrices. Then, the centric matrix is transferred to discrete cosine transform domain. Watermark is embedded in low frequency band of this matrix and next, the reverse of the transform is computed. Finally, watermarked ...
متن کاملA Modified Digital Image Watermarking Scheme Based on Nonnegative Matrix Factorization
This paper presents a modified digital image watermarking method based on nonnegative matrix factorization. Firstly, host image is factorized to the product of three nonnegative matrices. Then, the centric matrix is transferred to discrete cosine transform domain. Watermark is embedded in low frequency band of this matrix and next, the reverse of the transform is computed. Finally, watermarked ...
متن کاملMultifactor sparse feature extraction using Convolutive Nonnegative Tucker Decomposition
Multilinear algebra of the higher-order tensor has been proposed as a potential mathematical framework for machine learning to investigate the relationships among multiple factors underlying the observations. One popular model Nonnegative Tucker Decomposition (NTD) allows us to explore the interactions of different factors with nonnegative constraints. In order to reduce degeneracy problem of t...
متن کاملOn the construction of symmetric nonnegative matrix with prescribed Ritz values
In this paper for a given prescribed Ritz values that satisfy in the some special conditions, we find a symmetric nonnegative matrix, such that the given set be its Ritz values.
متن کاملExtended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols
We show that the binary logarithm of the non-negative rank of a non-negative matrix is, up to small constants, equal to the minimum complexity of a randomized communication protocol computing the matrix in expectation. We use this connection to prove new conditional lower bounds on the sizes of extended formulations, in particular, for perfect matching polytopes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012